github.com/andybalholm/brotli.blockEncoder.histogram_length_ (field)

13 uses

	github.com/andybalholm/brotli (current package)
		brotli_bit_stream.go#L1103: 	histogram_length_ uint
		brotli_bit_stream.go#L1130: 	self.histogram_length_ = histogram_length
		brotli_bit_stream.go#L1170: 		self.entropy_ix_ = uint(block_type) * self.histogram_length_
		brotli_bit_stream.go#L1201: 		var ix uint = histo_ix*self.histogram_length_ + symbol
		brotli_bit_stream.go#L1207: 	var table_size uint = histograms_size * self.histogram_length_
		brotli_bit_stream.go#L1221: 			var ix uint = i * self.histogram_length_
		brotli_bit_stream.go#L1222: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1228: 	var table_size uint = histograms_size * self.histogram_length_
		brotli_bit_stream.go#L1242: 			var ix uint = i * self.histogram_length_
		brotli_bit_stream.go#L1243: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1249: 	var table_size uint = histograms_size * self.histogram_length_
		brotli_bit_stream.go#L1263: 			var ix uint = i * self.histogram_length_
		brotli_bit_stream.go#L1264: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)